Spread-Spectrum Based on Finite Field Fourier Transforms
نویسندگان
چکیده
Spread-spectrum systems are presented, which are based on Finite Field Fourier Transforms. Orthogonal spreading sequences defined over a finite field are derived. New digital multiplex schemes based on such spread-spectrum systems are also introduced, which are multilevel Coding Division Multiplex. These schemes termed Galois-field Division Multiplex (GDM) offer compact bandwidth requirements because only leaders of cyclotomic cosets are needed to be transmitted.
منابع مشابه
Orthogonal Multilevel Spreading Sequence Design
Finite field transforms are offered as a new tool of spreading sequence design. This approach exploits orthogonality properties of synchronous non-binary sequences defined over a complex finite field. It is promising for channels supporting a high signal-to-noise ratio. New digital multiplex schemes based on such sequences have also been introduced, which are multilevel Code Division Multiplex....
متن کاملOn Galois-Division Multiple Access Systems: Figures of Merit and Performance Evaluation
A new approach to multiple access based on finite field transforms is investigated. These schemes, termed Galois-Division Multiple Access (GDMA), offer compact bandwidth requirements. A new digital transform, the Finite Field Hartley Transform (FFHT) requires to deal with fields of characteristic p, p 2. A binary-to-p-ary (p 2) mapping based on the opportunistic secondary channel is introdu...
متن کاملISAR Image Improvement Using STFT Kernel Width Optimization Based On Minimum Entropy Criterion
Nowadays, Radar systems have many applications and radar imaging is one of the most important of these applications. Inverse Synthetic Aperture Radar (ISAR) is used to form an image from moving targets. Conventional methods use Fourier transform to retrieve Doppler information. However, because of maneuvering of the target, the Doppler spectrum becomes time-varying and the image is blurred. Joi...
متن کاملQuantum Fourier transforms for extracting hidden linear structures in finite fields ∗
We propose a definition for quantum Fourier transforms in settings where the algebraic structure is that of a finite field, and show that they can be performed efficiently by a quantum computer. Using these finite field quantum Fourier transforms, we obtain the strongest separation between quantum and classical query complexity known to date—specifically, we define a problem that requires Ω(2) ...
متن کاملAb initio calculations in a uniform magnetic field using periodic supercells.
We present a formulation of ab initio electronic structure calculations in a finite magnetic field, which retains the simplicity and efficiency of techniques widely used in first principles molecular dynamics simulations, based on plane-wave basis sets and Fourier transforms. In addition we discuss results obtained with this method for the energy spectrum of interacting electrons in quantum wel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.08109 شماره
صفحات -
تاریخ انتشار 2015